Cyclic vectors forLp(G)

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Prolongations and cyclic vectors

For functions belonging to invariant subspaces of the backward shift operator Bf = (f f(0))/z on spaces of analytic functions on the unit disk D, we explore, in a systematic way, the continuation properties of these functions.

متن کامل

Vectors, Cyclic Submodules and Projective Spaces Linked with Ternions

Given a ring of ternions R, i. e., a ring isomorphic to that of upper triangular 2×2 matrices with entries from an arbitrary commutative field F , a complete classification is performed of the vectors from the free left R-module R, n ≥ 1, and of the cyclic submodules generated by these vectors. The vectors fall into 5 + |F | and the submodules into 6 distinct orbits under the action of the gene...

متن کامل

On Cyclic Vectors and Thin Von Neumann Algebras

We prove that certain classes of von Neumann algebras with regular, injective subalgebras are thin. As a consequence, all Hochschild cohomology groups of these algebras are zero. Mathematics subject classification (2010): 46L10, 47A16.

متن کامل

On the Computation of Minimal Polynomials, Cyclic Vectors and Frobenius Forms

Various algorithms connected with the computation of the minimal polynomial of a square n n matrix over a eld K are presented here. The complexity of the rst algorithm, where the complete factorization of the characteristic polynomial is needed, is O(p nn 3). It produces the minimal polynomial and all characteristic subspaces of a matrix of size n. Furthermore an iterative algorithm for the min...

متن کامل

On the Computation of Minimal Polynomial, Cyclic Vectors and the Frobenius Form

Various algorithms connected with the computation of the minimal polynomial of a square n×n matrix over a field k are presented here. The complexity of the first algorithm, where the complete factorization of the characteristic polynomial is needed, is O( √ nn). It produces the minimal polynomial and all characteristic subspaces of a matrix of size n. Furthermore an iterative algorithm for the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1980

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1980.89.143